package com.datastructure.test.maxlengthofincrement;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.concurrent.ConcurrentHashMap;

public class MaxLengthOfIncrementPath {


    public static void main(String[] args) {
        int[][] arr = {{1,2},{3,4}};
        MaxLengthOfIncrementPath maxLengthOfIncrementPath = new MaxLengthOfIncrementPath();
        maxLengthOfIncrementPath.solve(arr);
    }

    public int maxLength=0;
    public List<Integer> res = new ArrayList<>();

    public int solve (int[][] matrix) {
        // write code here
        int[][] temp = new int[matrix.length+1][matrix[0].length+1];

        for (int i = 1; i < temp.length; i++) {
            for (int j = 1; j < temp[0].length; j++) {
                temp[i][j]=matrix[i-1][j-1];
            }
        }
        return maxLength;
    }
}
